Proof systems for planning under 0-approximation semantics
نویسندگان
چکیده
منابع مشابه
Proof System for Plan Verification under 0-Approximation Semantics
In this paper a proof system is developed for plan verification problems {X}c{Y } and {X}c{KWp} under 0-approximation semantics for AK . Here, for a plan c, two sets X,Y of fluent literals, and a literal p, {X}c{Y } (resp. {X}c{KWp}) means that all literals of Y become true (resp. p becomes known) after executing c in any initial state in which all literals in X are true. Then, soundness and co...
متن کاملUnder-Approximation Refinement for Classical Planning
A general and important problem of search-based planning techniques is the state explosion problem, which is usually tackled with approaches to reduce the branching factor of the planning task. Such approaches often implicitly exploit the observation that the number of available operators is higher than the number of operators that are actually needed to find a plan. In this paper, we propose a...
متن کاملNormalization, approximation, and semantics for combinator systems
This paper studies normalization of typeable terms and the relation between approximation semantics and filter models for Combinator Systems. It presents notions of approximants for terms, intersection type assignment, and reduction on type derivations; the last will be proved to be strongly normalizable. With this result, it is proved that every typeable term has an approximant with the same t...
متن کاملAn Architecture for Proof Planning Systems
This paper presents a generic architecture for proof planning systems in terms of an interaction between a customisable proof module and search module. These refer to both global and local information contained in reasoning states.
متن کاملProof planning for maintainable configuration systems
Configuration is a complex task generally involving varying measures of constraint satisfaction, optimization, and the management of soft constraints. Although many successful systems have been developed, these are often difficult to maintain and to generalize in rapidly changing domains. In this paper we consider building intelligent knowledge based systems with maintainability well to the for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2014
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-013-4854-1